Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
نویسنده
چکیده
A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. The paper recalls important operations on these relations, and an algorithm for their auto-intersection. Through a series of practical applications, it investigates the augmented descriptive power of n-WFSMs, w.r.t. classical 1and 2-WFSMs (acceptors and transducers). Some applications are not feasible with the latter.
منابع مشابه
Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted Finite-State Machines
The automatic extraction of acronyms and their meaning from corpora is an important sub-task of text mining. It can be seen as a special case of string alignment, where a text chunk is aligned with an acronym. Alternative alignments have different cost, and ideally the least costly one should give the correct meaning of the acronym. We show how this approach can be implemented by means of a 3-t...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملA Note on Join and Auto-Intersection of n-ary Rational Relations
A finite-state machine with n tapes describes a rational (or regular) relation on n strings. It is more expressive than a relational database table with n columns, which can only describe a finite relation. We describe some basic operations on n-ary rational relations and propose notation for them. (For generality we give the semiring-weighted case in which each tuple has a weight.) Unfortunate...
متن کاملar X iv : c s / 03 10 04 6 v 2 [ cs . C C ] 1 4 Ju n 20 04 Theory of One Tape Linear Time Turing Machines ∗
A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machi...
متن کاملVisits, Crosses, and Reversals for Nondeterministic Off-Line Machines
The different concepts involved in "reversal complexity"--counting reversals (sweeps), visits to a square, or crossing sequences--are discussed for nondeterministic off-line Turing machines with one working tape and for preset Turing machines, a generalization of two-way checking automata. Restriction to finite reversals or visits or crosses yields the same family, NSPACE(log2 n), for off-line ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1104.5362 شماره
صفحات -
تاریخ انتشار 2011